EACS: Effective Avoidance Combination Strategy
نویسندگان
چکیده
منابع مشابه
EACS: Effective Avoidance Combination Strategy
When navigating in crowds, humans are able to move efficiently between people. They look ahead to know which path would reduce the complexity of their interactions with others. Current navigation systems for virtual agents consider long-term planning to find a path in the static environment and short term reactions to avoid collisions with close obstacles. Recently some mid-term considerations ...
متن کاملPrey aggregation is an effective olfactory predator avoidance strategy
Predator-prey interactions have a major effect on species abundance and diversity, and aggregation is a well-known anti-predator behaviour. For immobile prey, the effectiveness of aggregation depends on two conditions: (a) the inability of the predator to consume all prey in a group and (b) detection of a single large group not being proportionally easier than that of several small groups. How ...
متن کاملThe Ranking of Effective Factors on Corporate Tax Avoidance
The Hierarchy of Effective Factors on Corporate Tax Avoidance Because of the information asymmetry within taxpayers and governments, commonly, the taxpayers try avoid the payment of tax. The problem can be explained by Agency theory. On the other hand, governmants try to maximize receiving tax by recognizing risky taxpayers and researchers try to recognize effective factors on tax avoidance. Th...
متن کاملA path planning strategy for obstacle avoidance
This paper presents an obstacle avoidance module dedicated to non-holonomic wheeled mobile robots. Chained system theory and deformable virtual zone principle are coupled to design an original framework based on path following formalism. The proposed strategy allows to correct the control output provided by a navigation module to preserve the robot security while assuring the navigation task. F...
متن کاملA Symmetric Strategy in Graph Avoidance Games
In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to a forbidden graph F loses. A symmetric strategy of the second player ensures that, independently of the first player’s strategy, the blue and the red subgraph are isomorphic after every round of the game. We address t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2016
ISSN: 0167-7055
DOI: 10.1111/cgf.13066